Markov Decision Processes for Service Facility Systems with Perishable Inventory
نویسندگان
چکیده
منابع مشابه
Markov Decision Processes for Service Facility Systems with Perishable Inventory
We consider a service facility system with perishable inventory with finite number of servers. Each server having one perishable item for providing service. The arrival of a customer at the system according to independent Poisson Processes with rate through a single channel. The service time of the customer is exponentially distributed with mean 1/ and the item in stock has exponential life...
متن کاملSemi Markov Decision Processes for Service Facility Systems with Perishable Inventory
We consider a service facility system with perishable inventory with finite number of servers. Each server having one perishable item for providing service. The arrival of a customer at the system according to independent Poisson Processes with rate through a single channel. The service time of the customer is exponentially distributed with mean 1/ and the item in stock has exponential life...
متن کاملMarkov Process for Service Facility systems with perishable inventory and analysis of a single server queue with reneging - Stochastic Model
ABSTRACT In this paper, we develop a supply network model for a service facility system with perishable inventory (on hand) by considering a two dimensional stochastic process of the form (L, X) = 0 )); ( ), ( ( t t X t L , where L (t) is the level of the on hand inventory and X (t) is the number of customers at time t. The inter-arrival time to the service station is assumed to be expone...
متن کاملA single server perishable inventory system with N additional options for service
This article presents a perishable (s; S) inventory system under continuous review at a service facility in which a waiting hall for customers is of nite size M. The arrival instants of customers to the service station constitutes a Poisson process. The life time of each items is assumed to be exponential. All arriving customers demand the rst "essential" service, whereas only some of them dema...
متن کاملAccelerated decomposition techniques for large discounted Markov decision processes
Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2010
ISSN: 0975-8887
DOI: 10.5120/1375-1852